Drawing Georeferenced Graphs - Combining Graph Drawing and Geographic Data
نویسندگان
چکیده
DATA VISUALIZATION Full Papers A Linear Time Algorithm for Visualizing Knotted Structures in 3 Pages Vitaliy Kurlin Supporting Event-based Geospatial Anomaly Detection with Geovisual Analytics Orland Hoeber and Monjitr Ul Hasan The Stor-e-Motion Visualization for Topic Evolution Tracking in Text Data Streams Andreas Weiler, Michael Grossniklaus and Marc H. Scholl The Visual Exploration of Aggregate Similarity for Multi-dimensional Clustering James Twellmeyer, Marco Hutter, Michael Behrisch, Jorn Kohlhammer and Tobias Schreck A User-centric Taxonomy for Multidimensional Data Projection Tasks Ronak Etemadpour, Lars Linsen, Christopher Crick and Angus Forbes Past, Present, and Future of 3D Software Visualization A Systematic Literature Analysis Richard Midler and Dirk Zeckzer Short Papers A Time-location-Based Itinerary Visualization Florian Haag, Thomas Schlegel and Thomas Ertl Interactive Visual Analysis of Lumbar Back Pain What the Lumbar Spine Tells About Your Life Paul Klemm, Sylvia Glafier, Kai Lawonn, Marko Rak, Henry Volzke, Katrin Hegenscheid and Bernhard Preim Edge-stacked Timelines for Visualizing Dynamic Weighted Digraphs Michael Burch, Tatya Mum andDaniel Weiskopf Information Visualization for CSV Open Data Files Structure Analysis Paulo Carvalho, Patrik Hitzelberger, Benoit Otjacques, Falma Bouali and Gilles Venturini Drawing Georeferenced Graphs Combining Graph Drawing and Geographic Data Giordano Da Lozzo, Marco Di Bartolomeo, Maurizio Patrignani, Giuseppe Di Battista, Davide Cannone andSergio Tortora Visualization of Large Scientific Datasets Analysis of Numerical Simulation Data and Astronomical Surveys Catalogues Bruno Thooris and Daniel Pomarede Visualizing Dynamic Weighted Digraphs with Partial Links Hansjorg Schmauder, Michael Burch and Daniel Weiskopf CereVA Visual Analysis of Functional Brain Connectivity Michael de Ridder, Karsten Klein andJinman Kim Automatic Illustration of Short Texts via Web Images Sandro Aldo Aramini, Edoardo Ardizzone and Giuseppe Mazzola Performance Assessment and Interpretation of Random Forests by Three-dimensional Visualizations Ronny Hdnsch and OlafHellwich MTTV An Interactive Trajectory Visualization and Analysis Tool Fabio Poiesi andAndrea Cavallaro The Visualization of Drama Hierarchies Vincenzo Lomhardo and Antonio Pizzo The Recursive Disk Metaphor A Glyph-based Approach for Software Visualization Richard Midler andDirk Zeckzer A Visual Analytics based Investigation on the Authorship of the Holy Quran Halim Sayoud Convex Hull Brushing in Scatter Plots Multi-dimensional Correlation Analysis Miguel Nunes, Kresimir Matkovic and Katja Biihler GENERAL DATA VISUALIZATION
منابع مشابه
Drawing Clustered Graphs in Three Dimensions
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a divide and conquer approach. More specifically, it draws each cluster in a 2D plane to minimise occlusion and ease navigation. Then a 3D drawing of the whole graph is constructed by combining these 2D drawings. Our ma...
متن کاملEvery Schnyder Drawing is a Greedy Embedding
Geographic routing is a routing paradigm, which uses geographic coordinates of network nodes to determine routes. Greedy routing, the simplest form of geographic routing forwards a packet to the closest neighbor towards the destination. A greedy embedding is a embedding of a graph on a geometric space such that greedy routing always guarantees delivery. A Schnyder drawing is a classical way to ...
متن کاملVisualizing Weighted Edges in Graphs
This paper introduces a new edge length heuristic that finds a graph layout where the edge lengths are proportional to the weights on the graph edges. The heuristic can be used in combination with the spring embedder to produce a compromise between a drawing with an accurate presentation of edge length and a drawing with good general comprehensibility. We describe our preliminary investigations...
متن کاملImproved Lower Bounds on the Area Requirements of Series-Parallel Graphs
We show that there exist series-parallel graphs requiring Ω(n2 √ ) area in any straight-line or poly-line grid drawing. Such a result is achieved in two steps. First, we show that, in any straight-line or poly-line drawing of K2,n, one side of the bounding box has length Ω(n), thus answering two questions posed by Biedl et al. Second, we show a family of series-parallel graphs requiring Ω(2 √ )...
متن کاملOrthogonal Graph Drawing ?
Interactive Graph Drawing allows the user to dynamically interact with a drawing as the design progresses while preserving the user's mental map. This paper presents a theoretical analysis of Relative-Coordinates and an extensive experimental study comparing the performance of two interactive orthogonal graph drawing scenaria: No-Change, and Relative-Coordinates.Our theoretical analysis found t...
متن کامل